0.00/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.11	% Command    : run_E %s %d THM
0.10/0.31	% Computer : n009.cluster.edu
0.10/0.31	% Model    : x86_64 x86_64
0.10/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.31	% Memory   : 8042.1875MB
0.10/0.31	% OS       : Linux 3.10.0-693.el7.x86_64
0.16/0.31	% CPULimit   : 960
0.16/0.31	% WCLimit    : 120
0.16/0.31	% DateTime   : Tue Aug  9 02:29:20 EDT 2022
0.16/0.31	% CPUTime    : 
0.16/0.41	Running higher-order on 8 cores theorem proving
0.16/0.41	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.16/0.41	# Version: 3.0pre003-ho
0.16/0.42	# Preprocessing class: HSSSSMSSSSSNSSA.
0.16/0.42	# Scheduled 8 strats onto 8 cores with 120 seconds (960 total)
0.16/0.42	# Starting post_as_ho12 with 120s (1) cores
0.16/0.42	# Starting new_bool_9 with 120s (1) cores
0.16/0.42	# Starting post_as_ho1 with 120s (1) cores
0.16/0.42	# Starting post_as_ho4 with 120s (1) cores
0.16/0.42	# Starting post_as_ho2 with 120s (1) cores
0.16/0.42	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.16/0.42	# Starting full_lambda_10 with 120s (1) cores
0.16/0.42	# Starting new_ho_8 with 120s (1) cores
0.16/0.42	# post_as_ho12 with pid 32607 completed with status 0
0.16/0.42	# Result found by post_as_ho12
0.16/0.42	# Preprocessing class: HSSSSMSSSSSNSSA.
0.16/0.42	# Scheduled 8 strats onto 8 cores with 120 seconds (960 total)
0.16/0.42	# Starting post_as_ho12 with 120s (1) cores
0.16/0.42	# No SInE strategy applied
0.16/0.42	# Search class: HGUNF-FFSS32-MSSFFSBN
0.16/0.42	# Scheduled 5 strats onto 1 cores with 120 seconds (120 total)
0.16/0.42	# Starting post_as_ho12 with 73s (1) cores
0.16/0.42	# post_as_ho12 with pid 32615 completed with status 0
0.16/0.42	# Result found by post_as_ho12
0.16/0.42	# Preprocessing class: HSSSSMSSSSSNSSA.
0.16/0.42	# Scheduled 8 strats onto 8 cores with 120 seconds (960 total)
0.16/0.42	# Starting post_as_ho12 with 120s (1) cores
0.16/0.42	# No SInE strategy applied
0.16/0.42	# Search class: HGUNF-FFSS32-MSSFFSBN
0.16/0.42	# Scheduled 5 strats onto 1 cores with 120 seconds (120 total)
0.16/0.42	# Starting post_as_ho12 with 73s (1) cores
0.16/0.42	# Preprocessing time       : 0.001 s
0.16/0.42	# Presaturation interreduction done
0.16/0.42	
0.16/0.42	# Proof found!
0.16/0.42	# SZS status Theorem
0.16/0.42	# SZS output start CNFRefutation
0.16/0.42	thf(decl_22, type, cHALF: $i > $i > $o).
0.16/0.42	thf(decl_23, type, cDOUBLE: $i > $i > $o).
0.16/0.42	thf(decl_24, type, cS: $i > $i).
0.16/0.42	thf(decl_25, type, c0: $i).
0.16/0.42	thf(decl_26, type, esk1_3: ($i > $i > $o) > $i > $i > $i).
0.16/0.42	thf(decl_27, type, esk2_3: ($i > $i > $o) > $i > $i > $i).
0.16/0.42	thf(decl_28, type, esk3_0: $i).
0.16/0.42	thf(decl_29, type, esk4_0: $i).
0.16/0.42	thf(cTHM301, conjecture, ((((![X1:$i > $i > $o, X2:$i, X3:$i]:(((X1 @ X2 @ X3)<=(((cDOUBLE @ X2 @ X3)&(X1 @ c0 @ c0))&![X4:$i, X5:$i]:(((X1 @ X4 @ X5)=>(X1 @ (cS @ X4) @ (cS @ (cS @ X5))))))))&(cHALF @ (cS @ c0) @ c0))&![X4:$i, X5:$i]:(((cHALF @ (cS @ (cS @ X4)) @ (cS @ X5))<=(cHALF @ X4 @ X5))))&(cHALF @ c0 @ c0))=>![X2:$i, X3:$i]:(((cHALF @ X3 @ X2)<=(cDOUBLE @ X2 @ X3)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM301)).
0.16/0.42	thf(c_0_1, negated_conjecture, ~(((((![X1:$i > $i > $o, X2:$i, X3:$i]:(((((cDOUBLE @ X2 @ X3)&(X1 @ c0 @ c0))&![X4:$i, X5:$i]:(((X1 @ X4 @ X5)=>(X1 @ (cS @ X4) @ (cS @ (cS @ X5))))))=>(X1 @ X2 @ X3)))&(cHALF @ (cS @ c0) @ c0))&![X4:$i, X5:$i]:(((cHALF @ X4 @ X5)=>(cHALF @ (cS @ (cS @ X4)) @ (cS @ X5)))))&(cHALF @ c0 @ c0))=>![X2:$i, X3:$i]:(((cDOUBLE @ X2 @ X3)=>(cHALF @ X3 @ X2))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM301])])).
0.16/0.42	thf(c_0_2, negated_conjecture, ![X15:$i > $i > $o, X16:$i, X17:$i, X20:$i, X21:$i]:((((((((X15 @ (esk1_3 @ X15 @ X16 @ X17) @ (esk2_3 @ X15 @ X16 @ X17))|(~(cDOUBLE @ X16 @ X17)|~(X15 @ c0 @ c0))|(X15 @ X16 @ X17))&(~(X15 @ (cS @ (esk1_3 @ X15 @ X16 @ X17)) @ (cS @ (cS @ (esk2_3 @ X15 @ X16 @ X17))))|(~(cDOUBLE @ X16 @ X17)|~(X15 @ c0 @ c0))|(X15 @ X16 @ X17)))&(cHALF @ (cS @ c0) @ c0))&(~(cHALF @ X20 @ X21)|(cHALF @ (cS @ (cS @ X20)) @ (cS @ X21))))&(cHALF @ c0 @ c0))&((cDOUBLE @ esk3_0 @ esk4_0)&~(cHALF @ esk4_0 @ esk3_0)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])).
0.16/0.42	thf(c_0_3, negated_conjecture, ![X3:$i, X2:$i, X1:$i > $i > $o]:(((X1 @ X2 @ X3)|~((X1 @ (cS @ (esk1_3 @ X1 @ X2 @ X3)) @ (cS @ (cS @ (esk2_3 @ X1 @ X2 @ X3)))))|~((cDOUBLE @ X2 @ X3))|~((X1 @ c0 @ c0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.16/0.42	thf(c_0_4, negated_conjecture, (cDOUBLE @ esk3_0 @ esk4_0), inference(split_conjunct,[status(thm)],[c_0_2])).
0.16/0.42	thf(c_0_5, negated_conjecture, ![X3:$i, X2:$i, X1:$i > $i > $o]:(((X1 @ (esk1_3 @ X1 @ X2 @ X3) @ (esk2_3 @ X1 @ X2 @ X3))|(X1 @ X2 @ X3)|~((cDOUBLE @ X2 @ X3))|~((X1 @ c0 @ c0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.16/0.42	thf(c_0_6, negated_conjecture, ![X1:$i > $i > $o]:(((X1 @ esk3_0 @ esk4_0)|~((X1 @ (cS @ (esk1_3 @ X1 @ esk3_0 @ esk4_0)) @ (cS @ (cS @ (esk2_3 @ X1 @ esk3_0 @ esk4_0)))))|~((X1 @ c0 @ c0)))), inference(spm,[status(thm)],[c_0_3, c_0_4])).
0.16/0.42	thf(c_0_7, negated_conjecture, ![X2:$i, X3:$i]:(((cHALF @ (cS @ (cS @ X2)) @ (cS @ X3))|~((cHALF @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.16/0.42	thf(c_0_8, negated_conjecture, (cHALF @ c0 @ c0), inference(split_conjunct,[status(thm)],[c_0_2])).
0.16/0.42	thf(c_0_9, negated_conjecture, ~((cHALF @ esk4_0 @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_2])).
0.16/0.42	thf(c_0_10, negated_conjecture, ![X1:$i > $i > $o]:(((X1 @ (esk1_3 @ X1 @ esk3_0 @ esk4_0) @ (esk2_3 @ X1 @ esk3_0 @ esk4_0))|(X1 @ esk3_0 @ esk4_0)|~((X1 @ c0 @ c0)))), inference(spm,[status(thm)],[c_0_5, c_0_4])).
0.16/0.42	thf(c_0_11, negated_conjecture, ~((cHALF @ (esk2_3 @ (^[Z0:$i, Z1:$i]:((cHALF @ Z1 @ Z0))) @ esk3_0 @ esk4_0) @ (esk1_3 @ (^[Z0:$i, Z1:$i]:((cHALF @ Z1 @ Z0))) @ esk3_0 @ esk4_0))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6, c_0_7]), c_0_8])]), c_0_9])).
0.16/0.42	thf(c_0_12, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_8]), c_0_11]), c_0_9]), ['proof']).
0.16/0.42	# SZS output end CNFRefutation
0.16/0.42	# Parsed axioms                        : 5
0.16/0.42	# Removed by relevancy pruning/SinE    : 0
0.16/0.42	# Initial clauses                      : 11
0.16/0.42	# Removed in clause preprocessing      : 4
0.16/0.42	# Initial clauses in saturation        : 7
0.16/0.42	# Processed clauses                    : 18
0.16/0.42	# ...of these trivial                  : 0
0.16/0.42	# ...subsumed                          : 0
0.16/0.42	# ...remaining for further processing  : 18
0.16/0.42	# Other redundant clauses eliminated   : 0
0.16/0.42	# Clauses deleted for lack of memory   : 0
0.16/0.42	# Backward-subsumed                    : 0
0.16/0.42	# Backward-rewritten                   : 0
0.16/0.42	# Generated clauses                    : 16
0.16/0.42	# ...of the previous two non-redundant : 7
0.16/0.42	# ...aggressively subsumed             : 0
0.16/0.42	# Contextual simplify-reflections      : 0
0.16/0.42	# Paramodulations                      : 8
0.16/0.42	# Factorizations                       : 0
0.16/0.42	# NegExts                              : 0
0.16/0.42	# Equation resolutions                 : 2
0.16/0.42	# Propositional unsat checks           : 0
0.16/0.42	#    Propositional check models        : 0
0.16/0.42	#    Propositional check unsatisfiable : 0
0.16/0.42	#    Propositional clauses             : 0
0.16/0.42	#    Propositional clauses after purity: 0
0.16/0.42	#    Propositional unsat core size     : 0
0.16/0.42	#    Propositional preprocessing time  : 0.000
0.16/0.42	#    Propositional encoding time       : 0.000
0.16/0.42	#    Propositional solver time         : 0.000
0.16/0.42	#    Success case prop preproc time    : 0.000
0.16/0.42	#    Success case prop encoding time   : 0.000
0.16/0.42	#    Success case prop solver time     : 0.000
0.16/0.42	# Current number of processed clauses  : 11
0.16/0.42	#    Positive orientable unit clauses  : 3
0.16/0.42	#    Positive unorientable unit clauses: 0
0.16/0.42	#    Negative unit clauses             : 2
0.16/0.42	#    Non-unit-clauses                  : 6
0.16/0.42	# Current number of unprocessed clauses: 2
0.16/0.42	# ...number of literals in the above   : 8
0.16/0.42	# Current number of archived formulas  : 0
0.16/0.42	# Current number of archived clauses   : 7
0.16/0.42	# Clause-clause subsumption calls (NU) : 1
0.16/0.42	# Rec. Clause-clause subsumption calls : 1
0.16/0.42	# Non-unit clause-clause subsumptions  : 0
0.16/0.42	# Unit Clause-clause subsumption calls : 0
0.16/0.42	# Rewrite failures with RHS unbound    : 0
0.16/0.42	# BW rewrite match attempts            : 0
0.16/0.42	# BW rewrite match successes           : 0
0.16/0.42	# Condensation attempts                : 0
0.16/0.42	# Condensation successes               : 0
0.16/0.42	# Termbank termtop insertions          : 2535
0.16/0.42	
0.16/0.42	# -------------------------------------------------
0.16/0.42	# User time                : 0.004 s
0.16/0.42	# System time              : 0.001 s
0.16/0.42	# Total time               : 0.006 s
0.16/0.42	# Maximum resident set size: 1700 pages
0.16/0.42	
0.16/0.42	# -------------------------------------------------
0.16/0.42	# User time                : 0.004 s
0.16/0.42	# System time              : 0.004 s
0.16/0.42	# Total time               : 0.008 s
0.16/0.42	# Maximum resident set size: 1720 pages
0.16/0.42	EOF